A sub-additive DC approach to the complementarity problem
نویسندگان
چکیده
منابع مشابه
A Sub-Additive DC Approach to the Complementarity Problem
In this article, we propose a new merit function based on sub-additive functions for solving a nonlinear complementarity problem (NCP). This leads to consider an optimization problem that is equivalent to the NCP. In the case of a concave NCP this optimization problem is a Difference of Convex (DC) program and we can therefore use DC Algorithm to locally solve it. We prove that in the case of a...
متن کاملfrom linguistics to literature: a linguistic approach to the study of linguistic deviations in the turkish divan of shahriar
chapter i provides an overview of structural linguistics and touches upon the saussurean dichotomies with the final goal of exploring their relevance to the stylistic studies of literature. to provide evidence for the singificance of the study, chapter ii deals with the controversial issue of linguistics and literature, and presents opposing views which, at the same time, have been central to t...
15 صفحه اولA DC programming approach for solving the symmetric Eigenvalue Complementarity Problem
In this paper, we investigate a DC (Difference of Convex functions) programming technique for solving large scale Eigenvalue Complementarity Problems (EiCP) with real symmetric matrices. Three equivalent formulations of EiCP are considered. We first reformulate them as DC programs and then using DCA (DC Algorithm) for their solution. Computational results show the robustness, efficiency, and hi...
متن کاملSolving the Quadratic Eigenvalue Complementarity Problem by DC Programming
We present in this paper some results for solving the Quadratic Eigenvalue Complementarity Problem (QEiCP) by using DC(Difference of Convex functions) programming approaches. Two equivalent Nonconvex Polynomial Programming (NLP) formulations of QEiCP are introduced. We focus on the construction of the DC programming formulations of the QEiCP from these NLPs. The corresponding numerical solution...
متن کاملEfficient DC programming approaches for the asymmetric eigenvalue complementarity problem
In this paper, we propose nonlinear programming formulations (NLP) and DC (Difference of Convex functions) programming approaches for the asymmetric eigenvalue complementarity problem (EiCP). The EiCP has a solution if and only if these NLPs have zero global optimal value. We reformulate the NLPs as DC Programs (DCP) which can be efficiently solved by DCA (DC Algorithm). Some preliminary numeri...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computational Optimization and Applications
سال: 2019
ISSN: 0926-6003,1573-2894
DOI: 10.1007/s10589-019-00078-w